LemkeHowson algorithm - PDFSEARCH.IO - Document Search Engine

LemkeHowson algorithm
Results: 18

#	Item
11	Electronic Notes in Discrete Mathematics–1072 Finding Gale Strings Marta M. Casetti, Julian Merschen, Bernhard von Stengel Dept. of Mathematics, London School of Economics, London WC2A 2AE, United Kingd Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2010-07-17 09:49:35 Mathematics Geometry Space Polytopes Topology Polyhedral combinatorics Game theory LemkeHowson algorithm Cyclic polytope Simplex Bimatrix game Simple polytope
12	Unit Vector Games Rahul Savani∗ Bernhard von Stengel† arXiv:1501.02243v3 [cs.GT] 14 Feb 2016 Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2016-03-26 12:48:17 Game theory Non-cooperative games LemkeHowson algorithm Bimatrix game Nash equilibrium Best response Zero-sum game Symmetric game Strategy Symmetric equilibrium Normal-form game Risk dominance
13	Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game∗ Rahul Savani and Bernhard von Stengel Department of Mathematics, London School of Economics Houghton St, London WC2A 2AE, United Kingdom email Add to Reading List Source URL: www.cdam.lse.ac.uk Language: English - Date: 2004-05-13 14:39:39 Game theory LemkeHowson algorithm Bimatrix game Nash equilibrium Strategy Symmetric game Best response Zero-sum game Normal-form game Symmetric equilibrium Risk dominance Folk theorem
14	Strategic Characterization of the Index of an Equilibrium Arndt von Schemde Bernhard von Stengel Department of Mathematics London School of Economics Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2006-07-19 12:59:23 Game theory Decision theory Gaming Leisure Bimatrix game Best response Nash equilibrium Strategy LemkeHowson algorithm Purification theorem
15	Tracing Equilibria in Extensive Games by Complementary Pivoting Bernhard von Stengel∗ Antoon van den Elzen† Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2012-03-25 14:07:19 Decision theory Gaming Non-cooperative games Game theory Mathematics Strategy Bimatrix game Nash equilibrium Best response Trembling hand perfect equilibrium LemkeHowson algorithm Zero-sum game
16	Econometrica, Vol. 74, No. 2 (March, 2006), 397–429 HARD-TO-SOLVE BIMATRIX GAMES BY RAHUL SAVANI AND BERNHARD VON STENGEL1 The Lemke–Howson algorithm is the classical method for finding one Nash equilibrium of a bim Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2006-03-03 11:56:34 Game theory LemkeHowson algorithm Bimatrix game Nash equilibrium Symmetric equilibrium Symmetric game Zero-sum game Strategy Polytope Risk dominance Abstract polytope
17	Algorithmic Game Theory Edited by ´ Tardos, and Vijay Vazirani Noam Nisan, Tim Roughgarden, Eva Contents Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2006-11-15 07:54:45 Game theory Mathematics Human behavior Nash equilibrium LemkeHowson algorithm Bimatrix game Best response Strategy Extensive-form game Solution concept Normal-form game Epsilon-equilibrium
18	arXiv:1210.4694v2 [cs.DM] 5 Apr 2014 Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2014-12-05 13:17:13 Polytopes Game theory LemkeHowson algorithm Matching Simplex

UPDATE